The Euler characteristic of a polyhedral product
نویسنده
چکیده
Given a finite simplicial complex L and a collection of pairs of spaces indexed by the vertices of L , one can define the “polyhedral product” of the collection with respect to L . We record a simple formula for its Euler characteristic. In special cases the formula simplifies further to one involving the h-polynomial of L .
منابع مشابه
The Edge - minimal Polyhedral Maps of Euler Characteristic – 8 ∗
In [2], a {5, 5}-equivelar polyhedral map of Euler characteristic −8 was constructed. In this article we prove that {5, 5}-equivelar polyhedral map of Euler characteristic −8 is unique. As a consequence, we get that the minimum number of edges in a non-orientable polyhedral map of Euler characteristic −8 is > 40. We have also constructed {5, 5}-equivelar polyhedral map of Euler characteristic −...
متن کاملA Result on Representations of Homology Manifolds by Finite Spaces
We prove a result relating the Euler characteristic of a polyhedral closed homology manifold to the finite space associated with a triangulation of the manifold. We then give a new proof that polyhedral closed homology manifolds have Euler characteristic 0.
متن کاملLight stars in large polyhedral maps on surfaces
It is well known that every polyhedral map with large enough number of vertices contains a vertex of degree at most 6. In this paper the existence of stars having low degree sum of their vertices in polyhedral maps is investigated. We will prove: if G is a polyhedral map on compact 2-manifold M with non-positive Euler characteristic (M) and G has more than 149| (M)| vertices then G contains an ...
متن کاملLocal Structures in Polyhedral Maps on Surfaces, and Path Transferability of Graphs
We extend Jendrol’ and Skupień’s results about the local structure of maps on the 2-sphere: In this paper we show that if a polyhedral map G on a surface M of Euler characteristic χ(M) ≤ 0 has more than 126|χ(M)| vertices, then G has a vertex with ”nearly” non-negative combinatorial curvature. As a corollary of this, we can deduce that path transferability of such graphs are at most 12. keyword...
متن کاملRigidity and Separation Indices of Graphs in Surfaces
Let Σ be a surface. We prove that rigidity indices of graphs which admit a polyhedral embedding in Σ and 5-connected graphs admitting an embedding in Σ are bounded by a constant depending on Σ. Moreover if the Euler characteristic of Σ is negative, then the separation index of graphs admitting a polyhedral embedding in Σ is also bounded. As a side result we show that distinguishing number of bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011